A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
نویسندگان
چکیده
منابع مشابه
Multi-objective branch-and-bound. Application to the bi-objective spanning tree problem
This paper focuses on a multi-objective derivation of branch-and-bound procedures. Such a procedure aims to provide the set of Pareto optimal solutions of a multi-objective combinatorial optimization problem. Unlike previous works on this issue, the bounding is performed here via a set of points rather than a single ideal point. The main idea is that a node in the search tree can be discarded i...
متن کاملUsing Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisited by Ehrgott and Gandibleux [9], as well as by Sourd and Spanjaard [17]. The idea behind it is very general, and can therefore be adapted to a wide range of biobjective combinatorial problem. We focus here on the bio...
متن کاملA branch and bound algorithm for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem edge costs lie in an interval instead of having a fixed value. Interval numbers model uncertainty about the exact cost values. A robust spanning tree is a spanning tree whose total cost minimizes the maximum deviation fr...
متن کاملA branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Given a connected undirected graph G = (V;E), the Minimum Branch Vertices Problem (MBVP) asks for a spanning tree of G with the minimum number of vertices having degree greater than two in the tree. These are called branch vertices. This problem, which has an application in the context of optical networks, is known to be NPhard. We model the MBVP as an integer linear program, with undirected va...
متن کاملSolving the Biobjective Minimum Spanning Tree problem using a k-best algorithm
We consider a two-phase method for computing the complete set of efficient solutions of the biobjective minimum spanning tree problem. The first phase computes the extreme efficient solutions by expanding the convex hull of the feasible space. The second phase repeatedly applies a k-best minimum spanning tree algorithm to find all nonextreme efficient solutions. We report results of our computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2008
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1070.0260